On the spectral radius of quasi-k-cyclic graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the spectral radius of quasi-tree graphs

A connected graphG = (V ,E) is called a quasi-tree, if there exists u0 ∈ V (G) such thatG− u0 is a tree. Denote Q(n, d0) = {G : G is a quasi tree graph of order n with G− u0 being a tree and dG(u0) = d0}. In this paper, we determined the maximal and the second maximal spectral radii of all quasi-tree graphs in the set Q(n, d0). © 2008 Elsevier Inc. All rights reserved. AMS classification: 05C50...

متن کامل

On the spectral radii of quasi-tree graphs and quasi-unicyclic graphs with k pendent vertices

A connected graph G = (V, E) is called a quasi-tree graph if there exists a vertex u0 ∈ V (G) such that G−u0 is a tree. A connected graph G = (V, E) is called a quasi-unicyclic graph if there exists a vertex u0 ∈ V (G) such that G− u0 is a unicyclic graph. Set T (n, k) := {G : G is a n-vertex quasi-tree graph with k pendant vertices}, and T (n, d0, k) := {G : G ∈ T (n, k) and there is a vertex ...

متن کامل

On the spectral radius of graphs

Let G be a simple undirected graph. For v ∈ V (G), the 2-degree of v is the sum of the degrees of the vertices adjacent to v. Denote by ρ(G) and μ(G) the spectral radius of the adjacency matrix and the Laplacian matrix of G, respectively. In this paper, we present two lower bounds of ρ(G) and μ(G) in terms of the degrees and the 2-degrees of vertices. © 2004 Elsevier Inc. All rights reserved. A...

متن کامل

On the spectral radius of graphs

We characterize the graphs which achieve the maximum value of the spectral radius of the adjacency matrix in the sets of all graphs with a given domination number and graphs with no isolated vertices and a given domination number. AMS Classification: 05C35, 05C50, 05C69

متن کامل

On graphs whose spectral radius

The structure of graphs whose largest eigenvalue is bounded by 3 2 √ 2 (≈ 2.1312) is investigated. In particular, such a graph can have at most one circuit, and has a natural quipu structure.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2010

ISSN: 0024-3795

DOI: 10.1016/j.laa.2010.06.007